Realization of Logical Circuits with Majority Logical Function as Symmetrical Function
نویسندگان
چکیده
منابع مشابه
On the logical depth function
We investigate the logical depth function of finite strings. For the function associated with string x with argument b and value d we have that d is the least running time of the computation of an element of the set of b-incompressible programs for x. For a given string we consider the possible gap between two values of this function if the arguments differ by just a constant. We show that ther...
متن کاملMetaphysics of Logical Realism
با اینکه اغلب به غلط تصور میشود که فلسفۀ تحلیلی، به عنوان یک جنبش ضد-متافیزیکی، هیچ ارتباطی با متافیزیک ندارد، اما دلایل خوبی وجود دارند که بر اساس آن میتوان تمایلات متافیزیکی فیلسوفان تحلیلی را تصدیق نمود و متعاقباً ماهیت ضد-متافیزیکی فلسفه تحلیلی را در تمام مراحل شکلگیریاش به حداقل رساند. چون فلسفه تحلیلی یک جنبش تاریخی است که ماهیت اصلی آن در چند مرحله شکل یافته است، لذا با پیگیری این مرا...
متن کاملUniform Logical Cryptanalysis of CubeHash Function
In this paper we present results of uniform logical cryptanalysis method applied to cryptographic hash function CubeHash. During the last decade, some of the most popular cryptographic hash functions were broken. Therefore, in 2007, National Institute of Standards and Technology (NIST), announced an international competition for a new Hash Standard called SHA-3. Only 14 candidates passed first ...
متن کاملLogical Function Decomposition Method for Synthesis of Digital Logical System Implemented with Programmable Logic Devices (PLD)
The paper consists in the use of some logical functions decomposition algorithms with application in the implementation of classical circuits like SSI, MSI and PLD. The decomposition methods use the Boolean matrix calculation. It is calculated the implementation costs emphasizing the most economical solutions. One important aspect of serial decomposition is the task of selecting “best candidate...
متن کاملMonotone Circuits for the Majority Function
We present a simple randomized construction of size O(n3) and depth 5:3logn+O(1) monotone circuits for the majority function on n variables. This result can be viewed as a reduction in the size and a partial derandomization of Valiant’s construction of an O(n5:3) monotone formula, [15]. On the other hand, compared with the deterministic monotone circuit obtained from the sorting network of Ajta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Polytechnica
سال: 2005
ISSN: 1805-2363,1210-2709
DOI: 10.14311/678